Searching a quantum database with Grover's search algorithm

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Database Searching by a Single Query

In this paper we give a quantum mechanical algorithm that can search a database by a single query, when the number of solutions is more than a quarter. It utilizes modified Grover operator of arbitrary phase.

متن کامل

Imperfect quantum searching algorithm

We point out that the criterion, derived by Long et al.[Phys. Rev A 61, 042305 (2000)], to judging the degree of inaccuracy under systematic errors in phase inversions in Grover’s quantum search algorithm is overestimated. Although this criterion is properly deduced, it lacks a more accurate characterization to the relation between systematic errors and the size of a quantum database. The crite...

متن کامل

{26 () Searching for a Global Search Algorithm

We report on a case study to assess the use of an advanced knowledge-based software design technique with programmers who have not participatedin the technique's development. We use the KIDS approach to algorithm design to construct two global search algorithms that route baggage through a transportation net. Construction of the second algorithm involves extending the KIDS knowledge base. Exper...

متن کامل

A faster database search for quantum computing

We propose a new algorithm for quantum database search. Our strategy is to partition the space of all possibilities into subspaces and use a judiciously chosen projection operator as a polarizer in every subspace to filter out the states which have the correct first n-2 qubits. Then we use Grover’s algorithm to determine which one of the four survived states is the oracle. This algorithm has th...

متن کامل

Quantum Partial Search of a Database with Several Target Items

Abstract. We consider a database separated into blocks. Blocks containing target items are called target blocks. Blocks without target items are called non-target blocks. We consider a case, when each target block has the same number of target items. We present a fast quantum algorithm, which finds one of the target blocks. Our algorithm is based on Grover-Radhakrishnan algorithm of partial sea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Journal of Physics

سال: 2021

ISSN: 0002-9505,1943-2909

DOI: 10.1119/10.0004835